The diophantine equation x 2 + 2 a · 17 b = y n

The Diophantine Equation B 2 X 4 ? Dy 2 = 1

If b and d are given positive integers with b > 1, then we show that the equation of the title possesses at most one solution in positive integers X; Y. Moreover, we give an explicit characterization of this solution, when it exists, in terms of fundamental units of associated quadratic elds. The proof utilizes estimates for linear forms in logarithms of algebraic numbers in conjunction with pr...

” THE DIOPHANTINE EQUATION x n = Dy 2 + 1 ”

On the Diophantine Equation X 2 + 7 =

In this paper we study the equation x+7 = y, in integers x, y, m with m ≥ 3, using a Frey curve and Ribet’s level lowering theorem. We adapt some ideas of Kraus to show that there are no solutions to the equation with m prime and 11 ≤ m < 10.

ON THE DIOPHANTINE EQUATION x + y = 2pz

We show, if p is prime, that the equation xn + yn = 2pz2 has no solutions in coprime integers x and y with |xy| ≥ 1 and n > p132p , and, if p 6= 7, the equation xn + yn = pz2 has no solutions in coprime integers x and y with |xy| ≥ 1 and n > p12p .

The Diophantine equation f(x) = g(y)

have finitely or infinitely many solutions in rational integers x and y? Due to the classical theorem of Siegel (see Theorem 10.1 below), the finiteness problem for (1), and even for a more general equation F (x, y) = 0 with F (x, y) ∈ Z[x, y], is decidable (). One has to: • decompose the polynomial F (x, y) into Q-irreducible factors; • for those factors which are not Q-reducible, determine th...